A Parallel program for the recognition of P-Invariant segments
نویسندگان
چکیده
LetP beanarbitrary,butxedpermutationon0:: N), withN0. Inthispaperwedesi gn a paral l el program that determines for each segment of N successive elements of its input sequence whether it is invariant under P. The program consists of a linear arrangement of cel l s and contains|in addition to links between neighbour cells|connections between cel l s thatare arbitrarilyfar apart. For some well-known instances of the general problem, such as palindrome recognition and square recognition, the solutions are systolic and comparabl e to the \traditional" ones. Depending on P , however, the solutions may be non-systol i c. Figure 1 gives an impression of the obtained parallel palindrome recognizer. a a a a a b b b c c c N N-1 N/2-N+3-N+6 N/2-1 a a Figure 1: General program for palindrome recognition.
منابع مشابه
Systolic Arrays for the Recognition of Permutation-Invariant Segments
Let P be a permutation defined on sequences of length N. A sequence of N values is said to be P-invariant when it does not change when permuted according to P. A program is said to recognize P-invariant segments when it determines for each segment of N successive input values whether it is P-invariant. In this paper we derive a program scheme that generates efficient parallel programs for the r...
متن کاملNon-zero probability of nearest neighbor searching
Nearest Neighbor (NN) searching is a challenging problem in data management and has been widely studied in data mining, pattern recognition and computational geometry. The goal of NN searching is efficiently reporting the nearest data to a given object as a query. In most of the studies both the data and query are assumed to be precise, however, due to the real applications of NN searching, suc...
متن کاملAffine invariant detection of perceptually parallel 3D planar curves
The problem of parallelism detection between two curves has been formulated in this paper as a line detection problem within an azne-invariant local similarity matrix computed for the two curves. Each element of this matrix gives an a$ne invariant measure of local parallelism for any pair of curve segments along the two curves. This approach enables the detection of a pair of parallel 3D planar...
متن کاملParallel Spatial Pyramid Match Kernel Algorithm for Object Recognition using a Cluster of Computers
This paper parallelizes the spatial pyramid match kernel (SPK) implementation. SPK is one of the most usable kernel methods, along with support vector machine classifier, with high accuracy in object recognition. MATLAB parallel computing toolbox has been used to parallelize SPK. In this implementation, MATLAB Message Passing Interface (MPI) functions and features included in the toolbox help u...
متن کاملAn Experimental Study on Blinking and Eye Movement Detection via EEG Signals for Human-Robot Interaction Purposes Based on a Spherical 2-DOF Parallel Robot
Blinking and eye movement are one of the most important abilities that most people have, even people with spinal cord problem. By using this ability these people could handle some of their activities such as moving their wheelchair without the help of others. One of the most important fields in Human-Robot Interaction is the development of artificial limbs working with brain signals. The purpos...
متن کامل